MSMPS Packet Scheduling Algorithm for VOQ Switches
نویسنده
چکیده
In this paper we present Maximal Size Matching with Permanent Selection (MSMPS) algorithm [1] which is responsibilities for circuit switching control. We discussed the general algorithm rules and circuit switching architecture which was used in our research. This switch architecture uses Virtual Output Queues (VOQ) for buffering incoming packets. MSMPS algorithm based on permanent connections between inputs and outputs. Simulations confirm that for large load our algorithm provides better efficiency than other algorithms.
منابع مشابه
Comparison of Packet Scheduling Algorithms for VOQ Switches
In this article two matching algorithms for optical switches are presented. First, Permanent algorithm, base on regular matching with one main arbiter. Second algorithm based on random selection of outputs. These algorithms were compared for Bernoulli traffic distribution models. Simulation for mentioned models have been carried out for switches of capacity 8x8, 16x16, 32x32. The results are co...
متن کاملA Practical Scheduler For High-Speed Packet Switches and Internet Routers
The input queued (IQ) crossbar based switching, employing virtual output queueing (VOQ), is the dominant architecture for high-performance packet switches. The performance of a VOQ switch depends solely on the scheduling algorithm used. Maximum Weight Matching (MWM) algorithms have optimal performance however they are not practical due to their hardware complexity. Round Robin (RR) based algori...
متن کاملA combined low Latency and Weighted Fair Queuing based Scheduling of an input-Queued Switch
Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm...
متن کاملA Parallel-Polled Virtual Output Queued Switch with a Buffered Crossbar
* This material is based upon work supported by the National Science Foundation under Grant No. 9875177. Abstract Input buffered switches with Virtual Output Queues (VOQ) are scalable to very high speeds, but require switch matrix scheduling algorithms to achieve high throughput. Existing scheduling algorithms based on parallel requestgrant-accept cycles cannot natively support variable length ...
متن کاملAn efficient single-iteration single-bit request scheduling algorithm for input-queued switches
Aiming at minimizing communication overhead of iterative scheduling algorithms for input-queued packet switches, an efficient single-iteration single-bit request scheduling algorithm called Highest Rank First with Request Compression 1 (HRF/RC1) is proposed. In HRF/RC1, scheduling priority is given to the preferred input–output pair first, where each input has a distinct preferred output in eac...
متن کامل